Note on 2-rainbow domination and Roman domination in graphs
نویسندگان
چکیده
منابع مشابه
On 2-rainbow domination and Roman domination in graphs
A Roman dominating function of a graph G is a function f : V → {0, 1, 2} such that every vertex with 0 has a neighbor with 2. The minimum of f (V (G)) = ∑ v∈V f (v) over all such functions is called the Roman domination number γR(G). A 2-rainbow dominating function of a graphG is a function g that assigns to each vertex a set of colors chosen from the set {1, 2}, for each vertex v ∈ V (G) such ...
متن کاملRoman Domination on Graphs
Recent articles by ReVelle [20, 21] in the Johns Hopkins Magazines suggested a new variation of domination called Roman domination, see also [22] for an integer programming formulation of the problem. Since then, there have been several articles on Roman domination and its variations [2, 3, 4, 5, 6, 11, 12, 14, 15, 16, 18, 24, 23, 25]. Emperor Constantine had the requirement that an army or leg...
متن کاملRoman domination in graphs
A Roman dominating function on a graph G = (V, E) is a function f : V → {0, 1, 2} satisfying the condition that every vertex u for which f(u) = 0 is adjacent to at least one vertex v for which f(v) = 2. The weight of a Roman dominating function is the value f(V ) = ∑ u∈V f(u). The minimum weight of a Roman dominating function on a graph G is called the Roman domination number of G. In this pape...
متن کاملRoman domination excellent graphs: trees
A Roman dominating function (RDF) on a graph $G = (V, E)$ is a labeling $f : V rightarrow {0, 1, 2}$ suchthat every vertex with label $0$ has a neighbor with label $2$. The weight of $f$ is the value $f(V) = Sigma_{vin V} f(v)$The Roman domination number, $gamma_R(G)$, of $G$ is theminimum weight of an RDF on $G$.An RDF of minimum weight is called a $gamma_R$-function.A graph G is said to be $g...
متن کاملOn the 2-rainbow domination in graphs
The concept of 2-rainbow domination of a graph G coincides with the ordinary domination of the prism G K2. In this paper, we show that the problem of deciding if a graph has a 2-rainbow dominating function of a given weight is NP-complete even when restricted to bipartite graphs or chordal graphs. Exact values of 2-rainbow domination numbers of several classes of graphs are found, and it is sho...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics Letters
سال: 2010
ISSN: 0893-9659
DOI: 10.1016/j.aml.2010.02.012